Tree Drawings on the Hexagonal Grid

We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of directions used for the edges from each node to its children from one to five, and to five patterns: straight, Y , ψ, X, and full. The ψ–drawings generalize hvor strictly upward drawings to ternary trees. We show that complete ternary trees have a ψ–drawing on a square of size O(n) and general ternary trees can be drawn within O(n) area. Both bounds are optimal. Sub–quadratic bounds are also obtained forX– pattern drawings of complete tetra trees, and for full–pattern drawings of complete penta trees, which are 4–ary and 5–ary trees. These results parallel and complement the ones of Frati [8] for straight–line orthogonal drawings of ternary trees. Moreover, we provide an algorithm for compacted straight–line drawings of penta trees on the hexagonal grid, such that the direction of the edges from a node to its children is given by our patterns and these edges have the same length. However, drawing trees on a hexagonal grid within a prescribed area or with unit length edges is NP–hard.